Section: New Results

Verification of Security Protocols in the Computational model

Participants : Bruno Blanchet, David Cadé.

We worked on our computationally-sound protocol verifier CryptoVerif in two directions.

First, this verifier includes a specialized compiler that generates secure implementations of protocols from CryptoVerif specifications. We completed a journal version of the proof that this compiler preserves security, which is to appear in the Journal of Computer Security [48]

Second, Bruno Blanchet extended CryptoVerif with support for equational theories: associativity, commutativity, non-commutative and commutative groups, exclusive or. The goal is to be able to verify protocols that rely on the algebraic properties of groups and exclusive or. The extended tool is available at http://cryptoverif.inria.fr .